- empty binary tree
- 空二叉树
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
empty binary tree
Look at other dictionaries:
Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Binary heap — Example of a complete binary max heap Example of a complete binary min heap A binary … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Binary space partitioning — (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of the scene by means of a tree data structure known as a BSP tree.In simpler words, it is a method of breaking … Wikipedia
Iterated binary operation — In mathematics, an iterated binary operation is an extension of a binary operation on a set S to a function on finite sequences of elements of S through repeated application. Common examples include the extension of the addition operation to the… … Wikipedia
Van Emde Boas tree — A van Emde Boas tree (or van Emde Boas priority queue), also known as a vEB tree, is a tree data structure which implements an associative array with m bit integer keys. It performs all operations in O(log m ) time. Notice that m is the size of… … Wikipedia
Ternary search tree — In computer science, a ternary search tree (trie,TST) is a ternary (three way) tree data structure which combines the time efficiency of digital tries with the space efficiency of binary search trees. The resulting structure is faster than… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
min/max kd-tree — A min/max kd tree is a kd tree with two scalar values a minimum and a maximum assigned to its nodes. The minimum/maximum of an inner node is equal the minimum/maximum of its children s minima/maxima. Contents 1 Construction 2 Properties 3… … Wikipedia
Min/max kd-tree — A min/max k d tree is a k d tree with two scalar values a minimum and a maximum assigned to its nodes. The minimum/maximum of an inner node is equal the minimum/maximum of its children s minima/maxima.ConstructionMin/max k d trees may be… … Wikipedia
